SCF - State Machine Controlled Flow

In this paper, existing state machine and dataaow models of computation are revisited. A common representation called SCF is presented that enables the representation of several dataaow models using a mixture of functional programming and state machines. In particular, models like cyclostatic dataaow 3, 8], Synchronous Data Flow 14, 15], marked graphs 7] and communicating state machines 11, 18, 1] as well Petri nets turn out to be special subclasses of the SCF model. The model can be extended with information on the timing of computations and timing constraints. In addition, as abstraction and reenement are deened, the new model supports a hierarchical approach to problems like scheduling, veriication and implementation.